package com.heima.thread.test;

import java.util.*;

class Solution1
{
    boolean[] isPrime = new boolean[110];
    int[] Prime = new int[110];
    int cnt = 0;
    public void initPrime()
    {
        isPrime[1] = true;
        for(int i=2;i<=100;++i){
            if(isPrime[i] == false){
                Prime[++cnt] = i;
            }
            for(int j=1;j<=cnt && i*Prime[j] <= 100;++j){
                isPrime[i*Prime[j]] = true;
                if(i % Prime[j] == 0){
                    break;
                }
            }
        }
    }
}


public class test {
    public static void main(String[] args) {
        // com.heima.thread.com.heima.thread.test.Solution1 res = new com.heima.thread.com.heima.thread.test.Solution1();
        // res.initPrime();
        // for (int i = 1; i <= res.cnt; i++) {
        //     System.out.println(res.Prime[i]);
        // }

        // Set<Integer> set = new HashSet<>();
        // Scanner sc = new Scanner(System.in);
        // while(true)
        // {
        //     int i = sc.nextInt();
        //     if(set.contains(i)){
        //         System.out.println("dup");
        //         break;
        //     }
        //     set.add(i);
        // }

        String str = "Hello World";
        String[] sAry = str.split(" ");
        for (String s : sAry) {
            System.out.println(s);
        }

        List<String> list = new ArrayList<String>();
    }
}
